Power-Efficient Positioning for Visible Light Systems via Chance Constrained Optimization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chance constrained uncertain classification via robust optimization

This paper studies the problem of constructing robust classifiers when the training is plagued with uncertainty. The problem is posed as a Chance-Constrained Program (CCP) which ensures that the uncertain datapoints are classified correctly with high probability. Unfortunately such a CCP turns out to be intractable. The key novelty is in employing Bernstein bounding schemes to relax the CCP as ...

متن کامل

Nitrogen doped TiO2 for efficient visible light photocatalytic dye degradation

In this study, Nitrogen doped TiO2 photocatalysts were prepared by the sol gel method and physicochemical properties were characterized by X-ray diffraction (XRD), and scanning electron microscopy (SEM), photoluminescence, and energy dispersive X-ray spectroscopy (DRS) techniques. The XRD data indicated that the nanoparticles had the same crystals structures as the pure TiO2</su...

متن کامل

Optimal and Robust Power Allocation for Visible Light Positioning Systems under Illumination Constraints

The problem of optimal power allocation among light emitting diode (LED) transmitters in a visible light positioning (VLP) system is considered for the purpose of improving localization performance of visible light communication (VLC) receivers. Specifically, the aim is to minimize the Cramér-Rao lower bound (CRLB) on the localization error of a VLC receiver by optimizing LED transmission power...

متن کامل

Chance-constrained optimization via randomization: feasibility and optimality

In this paper we study the link between a semi-infinite chance-constrained optimization problem and its randomized version, i.e. the problem obtained by sampling a finite number of its constraints. Extending previous results on the feasibility of randomized convex programs, we establish here the feasibility of the solution obtained after the elimination of a portion of the sampled constraints. ...

متن کامل

SOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING

Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Aerospace and Electronic Systems

سال: 2020

ISSN: 0018-9251,1557-9603,2371-9877

DOI: 10.1109/taes.2020.2982304